empty functor

См. также в других словарях:

• Forgetful functor — In mathematics, in the area of category theory, a forgetful functor is a type of functor. The nomenclature is suggestive of such a functor s behaviour: given some object with structure as input, some or all of the object s structure or properties …   Wikipedia

• Sheaf (mathematics) — This article is about sheaves on topological spaces. For sheaves on a site see Grothendieck topology and Topos. In mathematics, a sheaf is a tool for systematically tracking locally defined data attached to the open sets of a topological space.… …   Wikipedia

• Initial and terminal objects — Terminal element redirects here. For the project management concept, see work breakdown structure. In category theory, an abstract branch of mathematics, an initial object of a category C is an object I in C such that for every object X in C,… …   Wikipedia

• Limit (category theory) — In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint… …   Wikipedia

• Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …   Wikipedia

• Coproduct — This article is about coproducts in categories. For coproduct in the sense of comultiplication, see Coalgebra. In category theory, the coproduct, or categorical sum, is the category theoretic construction which includes the disjoint union of sets …   Wikipedia

• Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

• Category theory — In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from sets and functions to objects and morphisms . Categories now appear in most branches of mathematics and in… …   Wikipedia

• Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

• Full and faithful functors — In category theory, a faithful functor (resp. a full functor) is a functor which is injective (resp. surjective) when restricted to each set of morphisms with a given source and target.Explicitly, let C and D be (locally small) categories and let …   Wikipedia

• Memoization — Not to be confused with Memorization. In computing, memoization is an optimization technique used primarily to speed up computer programs by having function calls avoid repeating the calculation of results for previously processed inputs.… …   Wikipedia